Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
نویسندگان
چکیده
The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (when packing into a knapsack). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria of a solution are the number of different cutting patterns (setups) and the maximum number of open stacks during the cutting process. There are applications where the number of stacks is restricted to two. We design a sequential heuristic to minimize material input while restricting the number of open stacks to any given limit. Then, the heuristic is simplified and integrated into a setup minimization approach in order to combine setup and open stacks minimization. To get a smaller number of open stacks, we may split up the problem into several parts of smaller dimension. Different solutions are evaluated in relation to the multiple objectives using the PARETO criterion. Finally we extend some known models by boolean variables that account for the states of stacks in the cutting sequence.
منابع مشابه
Cutting Stock with Bounded Open Stacks: a New Integer Linear Programming Model
We address a 1-dimensional cutting stock problem where, in addition to trimloss minimization, we require that the set of cutting patterns forming the solution can be sequenced so that the number of stacks of parts maintained open throughout the process never exceeds a given s. For this problem, we propose a new integer linear programming formulation whose constraints grow quadratically with the...
متن کاملA note on Integer Programming Models for Cutting Stock Problems with Setup Costs
The 1-dimensional Cutting Stock Problem (1-CSP) seeks to fulfill with a minimum trim loss the demand of parts of various lengths by cutting them out from a given stock size. In the Pattern Minimization Problem (1-PMP) one wants an optimal 1-CSP solution that uses a minimum number of distinct cutting patterns. We discuss two formulations of 1-PMP: (1) introduced by Vanderbeck, and (2) obtained b...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملThe trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...
متن کاملSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFORMS Journal on Computing
دوره 19 شماره
صفحات -
تاریخ انتشار 2007